A Calculus for Hybrid CSP

نویسندگان

  • Jiang Liu
  • Jidong Lv
  • Zhao Quan
  • Naijun Zhan
  • Hengjun Zhao
  • Chaochen Zhou
  • Liang Zou
چکیده

Hybrid Communicating Sequential Processes (HCSP) is an extension of CSP allowing continuous dynamics. We are interested in applying HCSP to model and verify hybrid systems. This paper is to present a calculus for a subset of HCSP as a part of our efforts in modelling and verifying hybrid systems. The calculus consists of two parts. To deal with continuous dynamics, the calculus adopts differential invariants. A brief introduction to a complete algorithm for generating polynomial differential invariants is presented, which applies DISCOVERER, a symbolic computation tool for semi-algebraic systems. The other part of the calculus is a logic to reason about HCSP process, which involves communication, parallelism, real-time as well as continuous dynamics. This logic is named as Hybrid Hoare Logic. Its assertions consist of traditional preand post-conditions, and also Duration Calculus formulas to record execution history of HCSP process. keywords: Chinese Train Control System, Differential Invariant, DISCOVERER, Duration Calculus, Hoare Logic, Hybrid CSP, Hybrid Logic

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Assume/Guarantee Based Compositional Calculus for Hybrid CSP

HCSP (Hybrid CSP) extends CSP to describe interacting continuous and discrete dynamics. The concurrency with synchronous communications, timing constructs, interrupts, differential equations, and so on, make the behavior of HCSP difficult to specify and verify. In this paper, we propose a Hoare-style calculus for reasoning about HCSP. The calculus includes Duration Calculus formulas to record p...

متن کامل

Super-Dense Computation in Verification of Hybrid CSP Processes

Hybrid Communicating Sequential Processes (HCSP) extends CSP to include differential equations and interruptions. We feel comfortable in our experience with HCSP to model scenarios of the Level 3 of Chinese Train Control System (CTCS-3), and to define a formal semantics for Simulink. The Hoare style calculus of [5] proposes a calculus to verify HCSP processes. However it has an error with respe...

متن کامل

Compositional Hoare-Style Reasoning About Hybrid CSP in the Duration Calculus

Deductive methods for the verification of hybrid systems vary on the format of statements in correctness proofs. Building on the example of Hoare triple-based reasoning, we have investigated several such methods for systems described in Hybrid CSP, each based on a different assertion language, notation for time, and notation for proofs, and each having its pros and cons with respect to expressi...

متن کامل

Extending Hybrid CSP with Probability and Stochasticity

Probabilistic and stochastic behavior are omnipresent in computer controlled systems, in particular, so-called safety-critical hybrid systems, because of fundamental properties of nature, uncertain environments, or simplifications to overcome complexity. Tightly intertwining discrete, continuous and stochastic dynamics complicates modelling, analysis and verification of stochastic hybrid system...

متن کامل

A CSP Model for Hybrid Automata

This contribution aims to combine hybrid automata with CSP establishing a connection between the elements of hybrid automata and CSP processes using an approach for the decomposition of hybrid systems. As a result we obtain a transformation from hybrid automata into CSP processes, written in Hoare-CSP in the untimed parts and in real-time CSP or HCSP in the timed parts. These processes provide ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010